Rich can get poor: conversion of hub to non-hub proteins
نویسندگان
چکیده
منابع مشابه
Active high-speed CAN hub
Performance test computations has been verified with a prototype. The HUB supporting ISO 11898-2 physical layer can operate at any baud rate, but in real systems the HUB can operate at baud rates up to 800kbps. In addition to the interfacespecific diagnostics features, HUB-based CAN-buses can ease systems designers by enabling star topology with improved tolerance against physical layer failure...
متن کاملMultiple-Localization and Hub Proteins
Protein-protein interactions are fundamental for all biological phenomena, and protein-protein interaction networks provide a global view of the interactions. The hub proteins, with many interaction partners, play vital roles in the networks. We investigated the subcellular localizations of proteins in the human network, and found that the ones localized in multiple subcellular compartments, es...
متن کاملIdentification of hub proteins from sequence
Identification of hub proteins from sequence is a challenge in molecular biology. Therefore, it is of interest to predict protein hubs in networks. We describe the prediction of protein "hub" using physiochemical, thermodynamic and conformational properties of amino acid residues in sequence. We have used twenty sequence based features to identify hub behaviour. Linear discriminant analysis and...
متن کاملEvolutionary and Physiological Importance of Hub Proteins
It has been claimed that proteins with more interaction partners (hubs) are both physiologically more important (i.e., less dispensable) and, owing to an assumed high density of binding sites, slow evolving. Not all analyses, however, support these results, probably because of biased and less-than reliable global protein interaction data. Here we provide the first examination of these issues us...
متن کاملHub Cover and Hub Center Problems
Using covering problems (CoP) combined with binary search is a well-known and successful solution approach for solving continuous center problems. In this paper, we show that this is also true for center hub location problems in networks. We introduce and compare various formulations for hub covering problems (HCoP) and analyse the feasibility polyhedron of the most promising one. Computational...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems and Synthetic Biology
سال: 2008
ISSN: 1872-5325,1872-5333
DOI: 10.1007/s11693-009-9024-9